Execution Models for Choreographies and Cryptoprotocols
نویسندگان
چکیده
منابع مشابه
Execution Models for Choreographies and Cryptoprotocols
A choreography describes a transaction in which several principals interact. Since choreographies frequently describe business processes affecting substantial assets, we need a security infrastructure in order to implement them safely. As part of a line of work devoted to generating cryptoprotocols from choreographies, we focus here on the execution models suited to the two levels. We give a st...
متن کاملExecution Semantics for Service Choreographies
A service choreography is a model of interactions in which a set of services engage to achieve a goal, seen from the perspective of an ideal observer that records all messages exchanged between these services. Choreographies have been put forward as a starting point for building service-oriented systems since they provide a global picture of the system’s behavior. In previous work we presented ...
متن کاملData Perspective in Process Choreographies: Modeling and Execution
Process choreographies are part of daily business. While the correct ordering of exchanged messages can be modeled and enacted with current choreography techniques, no approach exists to describe and enact a choreography’s data perspective. This paper describes an entirely model-driven approach for BPMN to include the data perspective while maintaining control flow aspects by utilizing a recent...
متن کاملVerification of Choreographies During Execution Using the Reactive Event Calculus
This article presents a run-time verification method of web service behaviour with respect to choreographies. We start from DecSerFlow as a graphical choreography description language. We select a core set of DecSerFlow elements and formalize them using a reactive version of the Event Calculus, based on the computational logic SCIFF framework. Our choice enables us to enrich DecSerFlow and the ...
متن کاملThe Perfect ``Spy'' for Model-Checking Cryptoprotocols
This paper describes the modeling of a fully potent attacker against cryptoprotocols, including its inference system, in the process algebra CSP. Techniques for keeping the state space within practical bounds for the model checker FDR2 are explained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.17.3